An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms
Identifieur interne : 004425 ( Main/Exploration ); précédent : 004424; suivant : 004426An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms
Auteurs : Jacques M. Bahi [France] ; Sylvain Contassot-Vivier [France] ; Raphaël Couturier [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper we present a practical, efficient and robust algorithm for detecting the global convergence in any asynchronous iterative process. A proven theoretical version, together with a first practical version, was presented in [1]. However, the main drawback of that first practical version was to require the determination of the maximal communication time between any couple of nodes in the system during the entire iterative process. The version presented in this paper does not require any additional information on the parallel system while always ensuring correct detections.
Url:
DOI: 10.1007/978-3-540-92859-1_22
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002D16
- to stream Istex, to step Curation: 002C79
- to stream Istex, to step Checkpoint: 000E53
- to stream Main, to step Merge: 004536
- to stream Main, to step Curation: 004425
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms</title><author><name sortKey="Bahi, Jacques M" sort="Bahi, Jacques M" uniqKey="Bahi J" first="Jacques M." last="Bahi">Jacques M. Bahi</name></author><author><name sortKey="Contassot Vivier, Sylvain" sort="Contassot Vivier, Sylvain" uniqKey="Contassot Vivier S" first="Sylvain" last="Contassot-Vivier">Sylvain Contassot-Vivier</name></author><author><name sortKey="Couturier, Raphael" sort="Couturier, Raphael" uniqKey="Couturier R" first="Raphaël" last="Couturier">Raphaël Couturier</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:BDDB436DF50C6FA96B69851E8894310140062DAB</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-92859-1_22</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-2036L6WJ-P/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002D16</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002D16</idno><idno type="wicri:Area/Istex/Curation">002C79</idno><idno type="wicri:Area/Istex/Checkpoint">000E53</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000E53</idno><idno type="wicri:doubleKey">0302-9743:2008:Bahi J:an:efficient:and</idno><idno type="wicri:Area/Main/Merge">004536</idno><idno type="wicri:Area/Main/Curation">004425</idno><idno type="wicri:Area/Main/Exploration">004425</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms</title><author><name sortKey="Bahi, Jacques M" sort="Bahi, Jacques M" uniqKey="Bahi J" first="Jacques M." last="Bahi">Jacques M. Bahi</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LIFC, University of Franche-Comte, Belfort</wicri:regionArea><placeName><region type="region">Bourgogne-Franche-Comté</region><region type="old region">Franche-Comté</region><settlement type="city">Belfort</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Contassot Vivier, Sylvain" sort="Contassot Vivier, Sylvain" uniqKey="Contassot Vivier S" first="Sylvain" last="Contassot-Vivier">Sylvain Contassot-Vivier</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, University Henri Poincaré, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Couturier, Raphael" sort="Couturier, Raphael" uniqKey="Couturier R" first="Raphaël" last="Couturier">Raphaël Couturier</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LIFC, University of Franche-Comte, Belfort</wicri:regionArea><placeName><region type="region">Bourgogne-Franche-Comté</region><region type="old region">Franche-Comté</region><settlement type="city">Belfort</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper we present a practical, efficient and robust algorithm for detecting the global convergence in any asynchronous iterative process. A proven theoretical version, together with a first practical version, was presented in [1]. However, the main drawback of that first practical version was to require the determination of the maximal communication time between any couple of nodes in the system during the entire iterative process. The version presented in this paper does not require any additional information on the parallel system while always ensuring correct detections.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Bourgogne-Franche-Comté</li><li>Franche-Comté</li><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Belfort</li><li>Nancy</li></settlement></list><tree><country name="France"><region name="Bourgogne-Franche-Comté"><name sortKey="Bahi, Jacques M" sort="Bahi, Jacques M" uniqKey="Bahi J" first="Jacques M." last="Bahi">Jacques M. Bahi</name></region><name sortKey="Bahi, Jacques M" sort="Bahi, Jacques M" uniqKey="Bahi J" first="Jacques M." last="Bahi">Jacques M. Bahi</name><name sortKey="Contassot Vivier, Sylvain" sort="Contassot Vivier, Sylvain" uniqKey="Contassot Vivier S" first="Sylvain" last="Contassot-Vivier">Sylvain Contassot-Vivier</name><name sortKey="Contassot Vivier, Sylvain" sort="Contassot Vivier, Sylvain" uniqKey="Contassot Vivier S" first="Sylvain" last="Contassot-Vivier">Sylvain Contassot-Vivier</name><name sortKey="Couturier, Raphael" sort="Couturier, Raphael" uniqKey="Couturier R" first="Raphaël" last="Couturier">Raphaël Couturier</name><name sortKey="Couturier, Raphael" sort="Couturier, Raphael" uniqKey="Couturier R" first="Raphaël" last="Couturier">Raphaël Couturier</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004425 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004425 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:BDDB436DF50C6FA96B69851E8894310140062DAB
|texte= An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms
}}
| This area was generated with Dilib version V0.6.33. |  |